Constraint Logic Programming over Infinite Domains with an Application to Proof
نویسندگان
چکیده
منابع مشابه
Constraint Logic Programming over Infinite Domains with an Application to Proof
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and if this has an impact on the soundness of the result. We present a technique which guarantees soundness in the following way: if the constraint solver finds ...
متن کاملConstraint functional logic programming over finite domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP (FD) ) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP (FD) ) by combining functional and relational notation, curried ...
متن کاملConstraint satisfaction with infinite domains
Constraint satisfaction problems occur in many areas of computer science, most prominently in artificial intelligence including temporal or spacial reasoning, belief maintenance, machine vision, and scheduling (for an overview see [Kumar, 1992,Dechter, 2003]). Other areas are graph theory, boolean satisfiability, type systems for programming languages, database theory, automatic theorem proving...
متن کاملConjunto: Constraint Logic Programming with Finite Set Domains
Combinatorial problems involving sets and relations are currently tackled by integer programming and expressed with vectors or matrices of 0-1 variables. This is eecient but not exible and unnatural in problem formulation. Toward a natural programming of combinatorial problems based on sets, graphs or relations, we deene a new CLP language with set constraints. This language Conjunto 1 aims at ...
متن کاملConstraint Logic Programming over Unions of Constraint Theories
In this paper, we present an extension of the Jaffar-Lassez constraint logic programming scheme that operates with unions of constraint theories with different signatures and decides the satisfiability of mixed constraints by appropriately combining the constraint solvers of the component theories. We describe the extended scheme, and provide logical and operational semantics for it along the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2017
ISSN: 2075-2180
DOI: 10.4204/eptcs.234.6